Benchmarks from Reduction Finding
نویسندگان
چکیده
Consider the problem of searching for a complexity-theoretic reduction between two decision problems, P and Q. Such a reduction is a function r satisfying x ∈ P ⇐⇒ r(x) ∈ Q for all structures x for which it makes sense to consider P . It is not difficult to show that determining the existence of reductions is undecidable in general. However, sufficiently restricting the class of reductions and structures considered results in a simpler, decidable variant that is still meaningful from a complexity-theory perspective. Once we can encode these reductions and structures in a finite number of bits, the problem becomes a QBF instance with one quantifier alternation (2QBF):
منابع مشابه
An integrated data envelopment analysis–artificial neural network approach for benchmarking of bank branches
Efficiency and quality of services are crucial to today’s banking industries. The competition in this section has become increasingly intense, as a result of fast improvements in Technology. Therefore, performance analysis of the banking sectors attracts more attention these days. Even though data envelopment analysis (DEA) is a pioneer approach in the literature as of an efficiency measurement...
متن کاملMST MEMS compact modeling meets model order reduction: Requirements and Benchmarks
Needs for model reduction in microsystem technology (MST) are described from an engineering perspective. The MST model reduction benchmarks are presented in order to facilitate further development in this area. The first benchmark application is electro-thermal simulation and the second one is an electrostatically actuated beam. Model reduction is contrasted with compact modeling, which current...
متن کاملOn computing the minimum feedback vertex set of a directed graph bycontraction operations
Finding the minimum feedback vertex set (MFVS) in a graph is an important problem for a variety of computer-aided design (CAD) applications and graph reduction plays an important role in solving this intractable problem. This paper is largely concerned with three new and powerful reduction operations. Each of these operations defines a new class of graphs, strictly larger than the class of cont...
متن کاملA cut-based method for terminal-pair reliability
Conclusions This paper assesses two categories of partition techniques for computing terminal-pair reliability (pathbased and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the pathbased algorithm with respect to the computation time for most benchmarks. A refinement of t...
متن کاملThe Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems
Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerprint recognition, object tracking and phishing web page detection to computing...
متن کامل